Even-hole-free graphs: a survey
نویسنده
چکیده
The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, which was the key initial motivation for their study. The techniques developed in the study of even-hole-free graphs were generalized to other complex hereditary graph classes, and in the case of perfect graphs led to the famous resolution of the Strong Perfect Graph Conjecture and their polynomial time recognition. The class of even-holefree graphs is also of independent interest due to its relationship to β-perfect graphs. In this survey we describe all the different structural characterizations of even-hole-free graphs, focusing on their algorithmic consequences.
منابع مشابه
Decomposition of even-hole-free graphs with star cutsets and 2-joins
In this paper we consider the class of simple graphs defined by excluding, as inducedsubgraphs, even holes (i.e. chordless cycles of even length). These graphs are known aseven-hole-free graphs. We prove a decomposition theorem for even-hole-free graphs, thatuses star cutsets and 2-joins. This is a significant strengthening of the only other pre-viously known decomposition of ev...
متن کاملTriangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cycle of length greater than three, as an induced subgraph. We prove that every even-hole-free graph has a node whose neighborhood is triangulated. This implies that in an even-hole-free graph, with n nodes and m edges, ...
متن کاملStructure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملEven-hole-free graphs part I: Decomposition theorem
We prove a decomposition theorem for even-hole-free graphs. The decompositions used are 2-joins and star, double-star and triple-star cutsets. This theorem is used in the second part of this paper to obtain a polytime recognition algorithm for even-hole-free graphs.
متن کاملEfficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete even for very restricted graph classes such as P7-free chordal gr...
متن کامل